Mixing and separating method for a plurality signals

ABSTRACT

A method and device for mixing and separating a plurality signals. In the mixing method, each of the m signal S i (t) to be mixexd within a time perid [T 0 , T 1 ] is sampled for n samples S i (t j ), j=1,2 . . . n, wherein tε[T 0 , T 1 ], T 0 , T 1  εR, t is time variable. Each sample is multiplied by a coefficient function  i a j (t) which is a linear independent set (i=1,2 . . . m, j=1,2 . . . n), thus obtaining m transformed signals for S i (t):            S   i   0          (   t   )       =       ∑     j   =   1     n                         [   i              a   j          (   t   )            S   i          (     t   j     )       ]     .                       
     By summing above m transformed signals obtains the mixed transformed signals are obtained:          SM        (   t   )       =       ∑     i   =   1     m                       [       S   i   0          (   t   )       ]     .                       
     As to the separating method, the coefficient function  i a j (t) is a linear independent set (i=1,2 . . . m, j=1,2 . . . n), therefore S i (t j ) are the unknown of m×n linear equation set and can be solved by known linear algebraic method.

FIELD OF THE INVENTION

This invention relates to a mixing and separating method for a plurality signals, more particularly, to achieve control circuit for signal processing.

BACKGROUND OF THE INVENTION

The electronic communication has grown more and more prosperous and the problem of available of communication channel becomes even serious. The bandwidth of a specific communication medium is limited, therefore how to most exploit the avail bandwidth is essential. It is the object of the invention to provide a method for transmitting a plurality of signals in a pair of transmission line or a single channel.

SUMMARY OF THE INVENTION Principles of the Invention I

The present invention is based on the principle of unique solution condition for a set of N linearly equations, i.e., linearly independence. Based on this principle, each of the m signal S_(i)(t) within period [T₀, T₁] is sampled for n samples S_(i)(t_(j)), j=1,2 . . . n, wherein tε[T₀, T₁], T₀, T₁ εR, t is time variable. Each sample is multiplied by a coefficient function _(i)a_(j)(t) which is a linear independent set (i=1,2 . . . m, j=1,2 . . . n), thus obtaining m transformed signals for S_(i)(t): ${S_{i}^{0}(t)} = {\sum\limits_{j = 1}^{n}\quad \left\lbrack {{{{}_{}^{}{}_{}^{}}(t)}{S_{i}\left( t_{j} \right)}} \right\rbrack}$

summing above m transformed signals obtains the mixed transformed signals: ${{SM}(t)} = {\sum\limits_{i = 1}^{m}\quad \left\lbrack {S_{i}^{0}(t)} \right\rbrack}$

The mixed transformed signals have m×n variables S_(i)(t_(j)) with coefficient _(i)a_(j)(t). If party A transmits SM(t) during time [T₀, T₁] to party B, party B will obtain message of m×n S_(i)(t_(j)), (i=1,2 . . . m, j=1,2 . . . n), wherein the bandwidth depends on the max bandwidth of _(i)a_(j)(t). More particularly, party A can m messages S_(i)(t) (i=1,2 . . . m) to party B during time [T₀, T₁], if the samples (unknowns) S_(i)(t₁), S_(i)(t₂), S_(i)(t₃) . . . S_(i)(t_(n)), ((i=1,2 . . . m) are sufficient to represent S_(i)(t) (i=1,2 . . . m) during time [T₀, T₁].

The party B can resolve S_(i)(t_(i)) upon receiving SM(t) if m×n−1 differential means are provided to obtain differential signals SM′(t), SM″(t) . . . SM^(m×n−1)(t): $\begin{matrix} {{{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {{{{}_{}^{}{}_{}^{}}(t)}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {{SM}(t)}}{{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {{{{}_{}^{}{}_{}^{}}(t)}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {{SM}^{\prime}(t)}}\vdots {{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {{{{}_{}^{}{}_{}^{\left( {{m \times n} - 1} \right)}}(t)}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {{SM}^{{m \times n} - 1}(t)}}} & (1) \end{matrix}$

Eq( 1) is an m×n equation set, wherein functions _(i)a_(j)(t) (i=1,2 . . . m, j=1,2 . . . n) are linear independent. Therefore, S_(i)(t_(i)) in Eq(1) has unique solution because the Wronskin (determinant)of functions _(i)a_(j)(t) is not equal to zero.

Therefore, the S_(i)(t_(i)) can be calculated by choosing a specific time t₀ within [T₀, T₁] and obtain _(i)a_(j) ^((u))(t₀) and SM^((u))(t₀). Moreover, each S_(i)(t) can be calculated (i=1,2 . . . m,j=1,2 . . . n, u=0, 1,2 . . . m×n−1).

Principles of the Invention II

The above solving procedure requires m×n−1 differential means to solve S_(i)(t), the hardware structure is bulky. However, party B can also take m×n samples after receiving SM(t): $\begin{matrix} {{{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {{{{}_{}^{}{}_{}^{}}\left( t_{1} \right)}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {{SM}\left( t_{1} \right)}}{{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {{{{}_{}^{}{}_{}^{}}\left( t_{2} \right)}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {{SM}\left( t_{2} \right)}}\vdots {{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {{{{}_{}^{}{}_{}^{}}\left( t_{m \times n} \right)}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {{SM}\left( t_{m \times n} \right)}}} & (2) \end{matrix}$

wherein t₁, t₂ . . . t_(m×n) are all within [T₀, T₁] and t_(u)≠t_(v) if u≠v, (u, v=0,1,2 . . . m×n). S_(i)(t) has unique solution because _(i)a_(j)(t) (i=1,2 . . . m, j=1,2 . . . n) are linear independent in [T₀, T₁].

Principles of the Invention III

In above scheme, party requires to take m×n samples within [T₀, T₁] even thought the differential means can be saved. The sample frequency will increase when the number of signal (m) increases. Therefore, the sampling rate of the A/D should be considered to determine the number of signal m.

To increase m and keep hardware compact, a compromise is to use m−1 differential means to get m differential signals (including original SM(t)), and to take n samples for each signal within [T₀, T₁] thus obtaining following equation set: $\begin{matrix} {{{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {{{{}_{}^{}{}_{}^{}}\left( t_{1} \right)}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {{SM}\left( t_{1} \right)}}{{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {{{{}_{}^{}{}_{}^{}}\left( t_{2} \right)}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {{SM}\left( t_{2} \right)}}\vdots {{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {{{{}_{}^{}{}_{}^{}}\left( t_{n} \right)}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {{SM}\left( t_{n} \right)}}{{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {{{{}_{}^{}{}_{}^{}}\left( t_{1} \right)}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {{SM}^{\prime}\left( t_{1} \right)}}{{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {{{{}_{}^{}{}_{}^{}}\left( t_{2} \right)}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {{SM}^{\prime}\left( t_{2} \right)}}\vdots {{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {{{{}_{}^{}{}_{}^{}}\left( t_{n} \right)}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {{SM}^{\prime}\left( t_{n} \right)}}\vdots {{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {{{{}_{}^{}{}_{}^{\left( {m - 1} \right)}}\left( t_{n} \right)}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {{SM}^{({m - 1})}\left( t_{n} \right)}}} & (3) \end{matrix}$

_(i)a_(j)(t) (i=1,2 . . . m, j=1,2 . . . n) are linear independent. Therefore, S_(i)(t_(i)) in Eq(3) has unique solution because the Wronskin (determinant) of functions _(i)a_(j)(t) is not equal to zero.

Party B has a plurality of ways to create m×n linear independent equation set form SM(t) as will be described below. $\begin{matrix} {{{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {{{{}_{}^{}{}_{}^{}}\left( t_{1} \right)}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {{SM}\left( t_{1} \right)}}{{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {{{{}_{}^{}{}_{}^{}}\left( t_{2} \right)}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {{SM}\left( t_{2} \right)}}\vdots {{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {{{{}_{}^{}{}_{}^{}}\left( t_{n} \right)}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {{SM}\left( t_{n} \right)}}{{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {\frac{1}{D}{{{}_{}^{}{}_{}^{}}\left( t_{1} \right)}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {\frac{1}{D}{{SM}\left( t_{1} \right)}}}{{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {\frac{1}{D}{{{}_{}^{}{}_{}^{}}\left( t_{2} \right)}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {\frac{1}{D}{{SM}\left( t_{2} \right)}}}{{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {\frac{1}{D}{{{}_{}^{}{}_{}^{}}\left( t_{n} \right)}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {\frac{1}{D}{{SM}\left( t_{n} \right)}}}\vdots {{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {\frac{1}{D^{m - 1}}{{{}_{}^{}{}_{}^{}}\left( t_{n} \right)}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {\frac{1}{D^{m - 1}}{{SM}\left( t_{n} \right)}}}} & (4) \end{matrix}$

wherein $\frac{1}{D^{u}}{{{}_{}^{}{}_{}^{}}\left( t_{v} \right)}$

 and $\frac{1}{D^{u}}{{SM}\left( t_{v} \right)}$

 is uth integration of _(i)a_(j)(t) and SM(t) from 0 to t_(v)., u=1,2 . . . m−1, v=1,2 . . . n.

Another alternative is: $\begin{matrix} {{{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {{{{}_{}^{}{}_{}^{}}\left( t_{1} \right)}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {{SM}\left( t_{1} \right)}}{{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {{{{}_{}^{}{}_{}^{}}\left( t_{2} \right)}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {{SM}\left( t_{2} \right)}}\vdots {{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {{{{}_{}^{}{}_{}^{}}\left( t_{n} \right)}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {{SM}\left( t_{n} \right)}}{{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {\Delta {{{}_{}^{}{}_{}^{}}\left( t_{1} \right)}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {\Delta \quad {{SM}\left( t_{1} \right)}}}{{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {\Delta {{{}_{}^{}{}_{}^{}}\left( t_{2} \right)}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {\Delta \quad {{SM}\left( t_{2} \right)}}}{{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {\Delta {{{}_{}^{}{}_{}^{}}\left( t_{n} \right)}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {\Delta \quad {{SM}\left( t_{n} \right)}}}\vdots {{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {\Delta^{m - 1}{{{}_{}^{}{}_{}^{}}\left( t_{n} \right)}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {\Delta^{m - 1}{{SM}\left( t_{n} \right)}}}} & (5) \end{matrix}$

wherein Δ^(u) _(i)a_(j)(t_(v)) and Δ^(u)SM(t_(v)) is uth differential of _(i)a_(j)(t) and SM(t) at t_(v), u=1,2 . . . m−1, v=1,2 . . . n.

Still another alternative is: $\begin{matrix} {{{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {{{{}_{}^{}{}_{}^{}}\left( t_{1} \right)}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {{SM}\left( t_{1} \right)}}{{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {{{{}_{}^{}{}_{}^{}}\left( t_{2} \right)}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {{SM}\left( t_{2} \right)}}\vdots {{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {{{{}_{}^{}{}_{}^{}}\left( t_{n} \right)}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {{SM}\left( t_{n} \right)}}{{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {{\nabla{{{}_{}^{}{}_{}^{}}\left( t_{1} \right)}}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {\nabla{{SM}\left( t_{1} \right)}}}{{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {{\nabla{{{}_{}^{}{}_{}^{}}\left( t_{2} \right)}}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {\nabla{{SM}\left( t_{2} \right)}}}{{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {{\nabla{{{}_{}^{}{}_{}^{}}\left( t_{n} \right)}}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {\nabla{{SM}\left( t_{n} \right)}}}\vdots {{\sum\limits_{i = 1}^{m}\quad {\sum\limits_{j = 1}^{n}\quad \left\lbrack {{\nabla^{m - 1}{{{}_{}^{}{}_{}^{}}\left( t_{n} \right)}}{S_{i}\left( t_{j} \right)}} \right\rbrack}} = {\nabla^{m - 1}{{SM}\left( t_{n} \right)}}}} & (6) \end{matrix}$

wherein ∇^(u) _(i)a_(j)(t_(v)) and ∇^(u)SM(t_(v)) is uth summation of _(i)a_(j)(t) and SM(t) from 0 to t_(v). u=1,2 . . . m−1, v=1,2 . . . n.

The determinant in each matrix of Eqs(4)-(6) is not zero because _(i)a_(j)(t) (i=1,2 . . . m, j=1,2 . . . n) are linear independent in [T₀, T₁]. Therefore, S₁(t) has unique solution for Eqs (4)-(6).

Moreover, party B can mix the operations of differential, integration, difference, summation and sampling to create m×n linear independent equation set. For example, taking differential, integration, difference, summation for number of r1, r2,r3 and r4, and taking sample number of h, such that (r1+r2+r3+r4)h=m×n, party B can create m×n linear independent equation set for solving S_(i)(t_(j)). However, the other methods are not described here for clarity.

Principles of the Invention IV

A particular choice of _(i)a_(j)(t) is described below, wherein _(i)a_(j)(t) thus selected are orthonormal for t within period [T₀, T₁] ${\int_{T_{0}}^{T_{1}}{{{{}_{}^{}{}_{}^{}}(x)}{{{}_{}^{}{}_{}^{}}(x)}\quad {x}}} = \left\{ \begin{matrix} {1;\quad {{{when}\quad k} = {{i\quad {and}\quad l} = j}}} \\ {0;\quad {{{when}\quad k} \neq {i\quad {or}\quad l} \neq j}} \end{matrix} \right.$

wherein i,k=1,2 . . . m, 1,j=1,2 . . . n.

in this situation ${\int_{T_{0}}^{T_{1}}{{{{SM}(x)}}{{{}_{}^{}{}_{}^{}}(x)}\quad {x}}} = {{\int_{T_{0}}^{T_{1}}{\left\lbrack {\sum\limits_{i = 1}^{m}\quad {\sum\limits_{J = 1}^{n}\quad {{{{}_{}^{}{}_{}^{}}(x)}{s_{i}\left( t_{j} \right)}}}} \right\rbrack {{{}_{}^{}{}_{}^{}}(x)}\quad {x}}} = {S_{k}\left( t_{l} \right)}}$

Therefore, when the transformed and mixed signal SM(t) is sent to the receiver during time period [T₀, T₁] the receiver party multiplies the received signal with _(k)a_(l)(t) (k=1,2 . . . m, 1=1,2 . . . n) and integrates the result between time period [T₀, T₁] to obtain S_(k)(t_(j)) (the Ith sample for the kth signal). This indicates that each sample value for each signal S_(i)(t_(j)) can be calculated without the step of solving the linear algebraic equation set.

Below describes the way to orthonormalize the function group {_(i)a_(j)(t) (i=1,2 . . . m, j=1,2 . . . n)} within time period [T₀, T₁].

First, m×n functions G₁(t), G₂ (t) . . . G_(m×n)(t) linearly independent within time period [T₀, T₁] are selected and let h(r, s) = ∫_(T₀)^(T₁)G_(r)(x)G_(s)(x)  x;  r, s = 1, 2  …  m × n A₀ = 1 $A_{v} = {{{\begin{matrix} {h\left( {1,1} \right)} & {h\left( {1,2} \right)} & {h\left( {1,3} \right)} & \ldots & {h\left( {1,v} \right)} \\ {h\left( {2,1} \right)} & {h\left( {2,2} \right)} & {h\left( {2,3} \right)} & \ldots & {h\left( {2,v} \right)} \\ {h\left( {3,1} \right)} & {h\left( {3,2} \right)} & {h\left( {3,3} \right)} & \ldots & {h\left( {3,v} \right)} \\ \ldots & \ldots & \ldots & \ldots & \ldots \\ {h\left( {v,1} \right)} & {h\left( {v,2} \right)} & {h\left( {v,3} \right)} & \ldots & {h\left( {v,v} \right)} \end{matrix}}\quad v} = {1.2\quad \ldots \quad m \times n}}$

then establishing the function $A_{v} = {\begin{matrix} {h\left( {1,1} \right)} & {h\left( {1,2} \right)} & {h\left( {1,3} \right)} & \ldots & {h\left( {1,u} \right)} \\ {h\left( {2,1} \right)} & {h\left( {2,2} \right)} & {h\left( {2,3} \right)} & \ldots & {h\left( {2,u} \right)} \\ \ldots & \ldots & \ldots & \ldots & \ldots \\ {h\left( {{u - 1},1} \right)} & {h\left( {{u - 1},2} \right)} & {h\left( {u - 1.3} \right)} & \ldots & {h\left( {{u - 1},u} \right)} \\ {G_{1}(t)} & {G_{2}(t)} & {G_{3}(t)} & \ldots & \left. {G_{u}(t)} \right) \end{matrix}}$ u = 1.2  …  m × n

then the function ${{{l_{u}(t)} = {\frac{1}{\sqrt{A_{u - 1}A_{u}}}{P_{u}(t)}}};\quad {u = 1}},{2\quad \ldots \quad m \times n}$

is orthonormal within time period [T₀, T₁].

Moreover, assume _(i)a_(j)(t)=Q(I−1)n+j(t) (i=1,2 . . . m, j=1,2 . . . n), that is

₁a₂(t)=Q₁(t)

₁a₂(t)=Q₂(t)

•

•

•

₁a_(n)(t)=Q_(n)(t)

₂a₁(t)=Q_(1+n)(t)

₂a₂(t)=Q_(2+n)(t)

•

•

•

₂a_(n)(t)=Q_(2n)(t)

₃a₁(t)=Q_(1+2n)(t)

₃a₂(t)=Q_(2+2n)(t)

•

•

•

₃a₂(t)=Q_(3n)(t)

•

•

•

_(m)a_(n)(t)=Q_(m×n)(t)

Apparently, function group {_(i)a_(j)(t) (i=1,2 . . . m, j=1,2 . . . n)} are orthonormal within time period [T₀, T₁]. In above procedure for receiver party to restore S_(k)(t₁), the step of solving linear algebraic equation is eliminated. However, m×n integrals are required, this will make the hardware complicated. The present invention provide following approach.

By choosing suitable function group {G_(u)(t)|u=1,2 . . . m×n}, _(k)a₁(t) can be expressed into Power series as following: $\begin{matrix} {{{{}_{}^{}{}_{}^{}}(t)} = \quad {{{{}_{}^{}{}_{}^{}}(b)} + \quad {{{{}_{}^{}{}_{}^{}}(b)}\quad {t\left( {t - b} \right)}} + \quad {\frac{1}{2!}\quad {{{}_{}^{}{}_{}^{}}(b)}\quad \left( {t - b} \right)^{2}} +}} \\ {\quad {{\frac{1}{3!}{{{}_{}^{}{}_{}^{}}(b)}\left( {t - b} \right)^{3}\quad \ldots}\quad;\quad {b \in \quad R}}} \end{matrix}$

Because the high frequency components of _(k)a_(l)(t) are limited, the first several terms are sufficiently to represent _(k)a_(l)(t). Assuming that first M terms are considered here, _(k)a_(l)(t) can be expressed as: ${{{{}_{}^{}{}_{}^{}}(t)} \cong {\sum\limits_{q = 0}^{M - 1}\quad {\left\lbrack {\frac{1}{q!}{{{}_{}^{}{}_{}^{(q)}}(b)}\left( {t - b} \right)^{q}} \right\rbrack \quad b}}} \in R$

then $\begin{matrix} \begin{matrix} {{S_{k}\left( t_{l} \right)} = \quad {\int_{T_{0}}^{T_{1}}{{{SM}(x)}_{k}{a_{l}(x)}\quad {x}}}} \\ {= \quad {\sum\limits_{q = 0}^{M - 1}\quad \left\lbrack {\frac{1}{q!}{{{}_{}^{}{}_{}^{(q)}}(b)}{\int_{T_{0}}^{T_{1}}{{{SM}(x)}\left( {x - b} \right)^{q}\quad {x}}}} \right\rbrack}} \end{matrix} & (7) \end{matrix}$

The receiver party only need to store m×n×M data ${\frac{1}{q!}{{{}_{}^{}{}_{}^{(q)}}(b)}\quad \left( {{k = 1},{2\quad \ldots \quad m},{l = 1},{2\quad \ldots \quad n},\quad {q = 0},{{1\quad \ldots \quad M};{b\quad \in R}}} \right)},$

then calculate M integrals ∫_(T₀)^(T₁)SM(x)(x − b)^(q)  x

upon receiving the SM(t). The m×n samples S_(k)(t₁) are restored. In other word, receiver party only requires to prepare M integrators other than m×n.

Moreover, above approach is also applicable to the data compress technology. The m×n samples S_(k)(t₁) can be approximately represented by M data: ∫_(T₀)^(T₁)SM(x)(x − b)^(q)  x;  q = 0, 1, 2  …  M − 1;  b ∈ R

In other word, the function group {_(i)a_(j)(t) (i=1,2 . . . m, j=1,2 . . . n)} are orthonormalized within time period [T₀, T₁] by above procedure. The M data; ∫_(T₀)^(T₁)SM(x)(x − b)^(q)  x;  q = 0, 1, 2  …  M − 1;  b ∈ R

are calculated by using known m×n samples S_(k)(t₁). Afterward, Eq(7) is employed to restore m×n samples S_(k)(t₁), wherein ∫_(T₀)^(T₁)SM(x)(x − b)^(q)  x

are the data after compression and $\frac{1}{q!}{{{}_{}^{}{}_{}^{(q)}}(b)}$

refers to the restoring parameter. It is apparent that the invention is applicable both to transmission of mass data or the compression technology of signal

Principles of the Invention V

From above description, party A sends message to party B segment by segment with time duration [T₀, T₁]. However, party A need to send a synchronous signal before sending signal containing message.

Therefore, the duration [T₀, T₁] is divided into first synchronous period [T₀, T₁′] for sending synchronous signal, and second information period [T₁′, T₁] for sending information (T₀<T₁′<T₁). The decrease of information period due to the incorporation of synchronous period will not influence bandwidth because the maximum bandwidth depends on _(i)a_(j)(t)

The various objects and advantages of the present invention will be more readily understood from the following detailed description when read in conjunction with the appended drawing, in which:

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is an analog adding circuit in the invention.

FIG. 2 show an inverted amplifier scheme in the invention.

FIG. 3 shows the generating circuit for mixed signal SM(t).

FIG. 4 is the schematic diagram of the control circuit 12 which outputs the mixing signal and the synchronous signal alternatively.

FIG. 5 is the control circuit 17 which make the analog signal be transferred into the digital signal, then be storage into the memory.

FIG. 6, is the whole hardware of party A.

FIG. 7 is a figure of a differential circuit comprising four differential means.

FIG. 8 is the separated circuit 24 which separates the several kind of the original type of the mixing signal.

FIG. 9 is the control circuit 22-i which can resolve the parallel equation, and store the resolve result into the memory.

FIG. 10. is the whole hardware of party A.

FIG. 11 is the schematic diagram of the all embodiment according by this invention, the number 19 is the party A shown in FIG. 6, the number 26 is the party B shown in FIG. 10.

FIG. 12 is the timing schematic diagram of the R1, R2 and CK which shown in the block 10 of FIG. 4.

DETAILED DESCRIPTION OF THE INVENTION Embodiment

Hereinafter, a preferred embodiment is used to substantially explain the present invention, wherein the communication medium is assumed to be an ideal (distortionless) medium.

In this embodiment, the Si(t) in Eq. (3) is solved and below list some important issues.

1. The choice of [T₀, T₁′], [T₁′, T₁], m, n and _(i)a_(j)(t):

Provided that

[T₀, T₁′]=[0, ε];

[T₁′, T₁]=[ε, 5ε],ε={fraction (1/1000)} sec;

m=5

n=8

_(i)a_(j)(t)=G(j+40I−40,t), i=1,2 . . . 5; j=1,2, . . . ,40;

wherein G(1,t)=cos [2(400+151)πt]; 1=1,2 . . . 200.

and taking 40 samples Si(t1), . . . , Si(t40) for Si(t) (i=1, 2, 3, 4, 5) in [T₀, T₁′]=[0, ε]

and further assuming

Sa(1)=S₁(t₁)

Sa(2)=S₁(t₂)

•

•

Sa(40)=S₁(t₄₀)

Sa(41)=S₂(t₁)

Sa(42)=S₂(t₂)

•

•

Sa(80)=S₂(t₄₀)

•

•

Sa(200)=S₅(t₄₀).

Then the party A (sender) create a mixed transformed signal SM(t) $\begin{matrix} {{{SM}(t)} = {\sum\limits_{u = 1}^{200}\quad \left\lbrack {{G\left( {u,t} \right)}{S_{a}(u)}} \right\rbrack}} & (7) \end{matrix}$

the SM(t) in above equation is transformed from party A to party B within [T₁′, T₁]=[ε, 5ε] and the maximum transmitting frequency is 3.4 kHz which depends on the function group cos [2(400+151)πt], not on the maximum frequency of Si(t).

2. The parameter setting in party B

The function group cos [2(400+151)πt] is linear independent in tε[ε, 5ε], therefore the below determinant is not zero. $W = {{\quad \begin{matrix} {G\left( {1,X_{1}} \right)} & {G\left( {2,X_{1}} \right)} & \cdots & {G\left( {200,X_{1}} \right)} \\ {G\left( {1,X_{2}} \right)} & {G\left( {2,X_{2}} \right)} & \cdots & {G\left( {200,X_{2}} \right)} \\ \vdots & \vdots & \cdots & \vdots \\ {G\left( {1,X_{40}} \right)} & {G\left( {2,X_{40}} \right)} & \cdots & {G\left( {200,X_{40}} \right)} \\ {G^{\prime}\left( {1,X_{1}} \right)} & {G^{\prime}\left( {2,X_{1}} \right)} & \cdots & {G^{\prime}\left( {200,X_{1}} \right)} \\ {G^{\prime}\left( {1,X_{2}} \right)} & {G^{\prime}\left( {2,X_{2}} \right)} & \cdots & {G^{\prime}\left( {200,X_{2}} \right)} \\ \vdots & \vdots & \cdots & \vdots \\ {G^{\prime}\left( {1,X_{40}} \right)} & {G^{\prime}\left( {2,X_{40}} \right)} & \cdots & {G^{\prime}\left( {200,X_{40}} \right)} \\ {G^{''}\left( {1,X_{1}} \right)} & {G^{''}\left( {2,X_{1}} \right)} & \cdots & {G^{''}\left( {200,X_{1}} \right)} \\ \vdots & \vdots & \cdots & \vdots \\ {G^{(4)}\left( {1,X_{40}} \right)} & {G^{(4)}\left( {2,X_{40}} \right)} & \cdots & {G^{(4)}\left( {200,X_{40}} \right)} \end{matrix}\quad }}$

wherein X1,X2 . . . X40 are corresponding to the sampling points within tε[ε, 5ε].

For convenience's sake, let

D(1,j)=G(jX1)

D(2,j)=G(j,X2)

•

•

D(40,j)=G(j,X40)

D(41,j)=G′(j,X1)

D(42,j)=G′(j,X2)

•

•

D(80,j)=G′(j,X40)

D(81,j)=G″(j,X1)

•

•

D(200,j )=G⁽⁴⁾(j,X40)

W can be written as $W = {\begin{matrix} {D\left( {1,1} \right)} & {D\left( {1,2} \right)} & \ldots & {D\left( {1,200} \right)} \\ {D\left( {2,1} \right)} & {D\left( {2,2} \right)} & \ldots & {D\left( {2,200} \right)} \\ \vdots & \vdots & \ldots & \vdots \\ {D\left( {200,1} \right)} & {D\left( {200,2} \right)} & \ldots & {D\left( {200,200} \right)} \end{matrix}}$

let ${z\left( {i,j} \right)} = {\begin{matrix} {D\left( {1,1} \right)} & {D\left( {1,2} \right)} & \ldots & {D\left( {1,{j - 1}} \right)} & {D\left( {1,{j + 1}} \right)} & \ldots & {D\left( {1,200} \right)} \\ {D\left( {2,1} \right)} & {D\left( {2,2} \right)} & \ldots & {D\left( {2,{j - 1}} \right)} & {D\left( {2,{j + 1}} \right)} & \ldots & {D\left( {2,200} \right)} \\ \vdots & \vdots & \ldots & \vdots & \vdots & \ldots & \vdots \\ {D\left( {{i - 1},1} \right)} & {D\left( {{i - 1},2} \right)} & \ldots & {D\left( {{i - 1},{j - 1}} \right)} & {D\left( {{i - 1},{j + 1}} \right)} & \ldots & {D\left( {{i - 1},200} \right)} \\ {D\left( {{i + 1},1} \right)} & {D\left( {{i + 1},2} \right)} & \ldots & {D\left( {{i + 1},{j - 1}} \right)} & {D\left( {{i + 1},{j + 1}} \right)} & \ldots & {D\left( {{i + 1},200} \right)} \\ \vdots & \vdots & \ldots & \vdots & \vdots & \ldots & \vdots \\ {D\left( {200,1} \right)} & {D\left( {200,2} \right)} & \ldots & {D\left( {200,{j - 1}} \right)} & {D\left( {200,{j + 1}} \right)} & \ldots & {D\left( {200,200} \right)} \end{matrix}}$

wherein i≧2, 199≧j

let ${Z\left( {1,j} \right)} = {\begin{matrix} {D\left( {2,1} \right)} & {D\left( {2,2} \right)} & \ldots & {D\left( {2,{j - 1}} \right)} & {D\left( {2,{j + 1}} \right)} & \ldots & {D\left( {2,200} \right)} \\ {D\left( {3,1} \right)} & {D\left( {3,2} \right)} & \ldots & {D\left( {3,{j - 1}} \right)} & {D\left( {3,{j + 1}} \right)} & \ldots & {D\left( {3,200} \right)} \\ \vdots & \vdots & \ldots & \vdots & \vdots & \ldots & \vdots \\ {D\left( {200,1} \right)} & {D\left( {200,2} \right)} & \ldots & {D\left( {200,{j - 1}} \right)} & {D\left( {200,{j + 1}} \right)} & \ldots & {D\left( {200,200} \right)} \end{matrix}}$ ${Z\left( {200,j} \right)} = {\begin{matrix} {D\left( {1,1} \right)} & {D\left( {1,2} \right)} & \ldots & {D\left( {1,{j - 1}} \right)} & {D\left( {1,{j + 1}} \right)} & \ldots & {D\left( {1,200} \right)} \\ {D\left( {2,1} \right)} & {D\left( {2,2} \right)} & \ldots & {D\left( {2,{j - 1}} \right)} & {D\left( {2,{j + 1}} \right)} & \ldots & {D\left( {2,200} \right)} \\ \vdots & \vdots & \ldots & \vdots & \vdots & \ldots & \vdots \\ {D\left( {199,1} \right)} & {D\left( {199,2} \right)} & \ldots & {D\left( {199,{j - 1}} \right)} & {D\left( {199,{j + 1}} \right)} & \ldots & {D\left( {199,200} \right)} \end{matrix}}$ ${Z\left( {i,1} \right)} = {\begin{matrix} {D\left( {1,2} \right)} & {D\left( {1,3} \right)} & \ldots & {D\left( {1,200} \right)} \\ {D\left( {2,2} \right)} & {D\left( {2,3} \right)} & \ldots & {D\left( {2,200} \right)} \\ \vdots & \vdots & \ldots & \vdots \\ {D\left( {{i - 1},2} \right)} & {D\left( {{i - 1},3} \right)} & \ldots & {D\left( {{i - 1},200} \right)} \\ {D\left( {{i + 1},2} \right)} & {D\left( {{i + 1},3} \right)} & \ldots & {D\left( {{i + 1},200} \right)} \\ {D\left( {200,2} \right)} & {D\left( {200,3} \right)} & \ldots & {D\left( {200,200} \right)} \end{matrix}}$ ${Z\left( {i,200} \right)} = {\begin{matrix} {D\left( {1,1} \right)} & {D\left( {1,2} \right)} & \ldots & {D\left( {1,199} \right)} \\ {D\left( {2,1} \right)} & {D\left( {2,2} \right)} & \ldots & {D\left( {2,199} \right)} \\ \vdots & \vdots & \ldots & \vdots \\ {D\left( {{i - 1},1} \right)} & {D\left( {{i - 1},2} \right)} & \ldots & {D\left( {{i - 1},199} \right)} \\ {D\left( {{i + 1},1} \right)} & {D\left( {{i + 1},2} \right)} & \ldots & {D\left( {{i + 1},199} \right)} \\ {D\left( {200,1} \right)} & {D\left( {200,2} \right)} & \ldots & {D\left( {200,199} \right)} \end{matrix}}$

moreover let

R(u,v)=(−1^()u+v) Z(u,v)/W  (8)

Wherein u,v=1, 2, . . . ,200

The R(u,v) in Eq(8) is the reverse-transform parameter, the value thereof are calculated by computer and then save in memory.

After party B receiving the signal as (7) from party A, party B uses differential means to obtain SM(t), SM′(t), SM″(t), SM′″(t) and SM⁽⁴⁾(t), and then takes sample to get 200 data including SM(X1), SM(X2), . . . SM(X40), SM′(X1), SM′(X2), . . . SM′(X40), . . . SM⁽⁴⁾(X1), . . .

SM⁽⁴⁾(X40)

For convenience, let

α(1)=SMG(X1)

α(2)=SM(X2)

•

•

α(40)=SM(X40)

α(41)=SM′(X1)

α(42)=SM′(X2)

•

•

α(80)=G′(X40)

α(81)=Gα(X1)

•

α(161)=G⁽⁴⁾(X1)

•

•

α(200)=G⁽⁴⁾(X40)

Sa(j) can be calculated by below equation $\begin{matrix} {{S_{a}(j)} = {\sum\limits_{i = 1}^{200}\quad \left\lbrack {{\alpha (i)}{R\left( {i,j} \right)}} \right\rbrack}} & (9) \end{matrix}$

wherein i=1,2, . . . 200

In (9), Sa(1), Sa(2)..Sa(40) are the samples in S₁(t) taken by party A, Sa(41), Sa(42) . . . Sa(80) are the samples in S₂(t) taken by party A, . . . Sa(161), Sa(162) . . . Sa(200) are the samples in S₅(t) taken by party A. Eq (9) is apparently a reverse-transform formula.

3. The hardware of party A (sender)

FIG. 1 is an analog adding circuit wherein 010 is a high-gain amplifier, 020 is feedback resistor, 021-1˜021-200 are input resistors. If all input resistors have resistance same as that of the feedback resistor, then

e ₀=−(e ₁ +e ₂ + . . . +e ₂₀₀)

wherein e₁,e₂ . . . e₂₀₀ are input voltages, and e₀ is output voltage.

FIG. 2 show an inverted amplifier scheme wherein output voltage e₀ equal to e_(in) multiplied by sample data Sa(i), (i=1,2 . . . ,200) and then inverted.

Below are features of FIG. 2.

1. 011 is operational amplifier

2. 022-0˜022-7 are eight serially-connected feedback resistors and the action thereof depend on the on-off state of electronic switch 040-0˜040-7. 022-j is shorted and has no action when 040-j is on, and has action when 040-j is off. The on-off state of 040-j is controlled by b_(j). 040-j is on when b_(j) is low, (j=0, 1,2 . . . 7).

3. Setting Sa(i) (i=1,2 . . . 200) as binary data in byte base, and has value of b₇X2⁷+b₆X2⁶+ . . . b₁X²+b₀X2⁰.

4. Let resistance of 022-0˜022-7 are r, 2r, 2²r, . . . 2⁷r, respectively, the resistance of input resistor 023 is r.

5. The resistance of feedback resistor will be controlled by Sa(i) (i=1,2 . . . 200) and becomes b₇X2⁷r+b₆X2⁶r+ . . . b₁X²r+b₀Xr=Sa(i)r.

 Therefore, input/output voltage has below relationship

e₀ =−Sz(I)e _(in)

FIG. 3 shows the generating circuit for mixed signal SM(t) which has following features.

1. 06-l is the generating circuit for functions cos [2(400+15l)πt] (l=1,2, . . . 200, l is time veriable) which generate those functions when signal in RESET off.

2. 05-1˜05-200 is the circuit shown in FIG. 2.

3. 03 is the circuit shown in FIG. 1.

4. 041-1, 041-2 are electronic switch, 070 is inverter, 041-1 OFF and 041-2 ON when SW HIGH.

5. When RS signal disappears and SW HIGH, ST generates signal SM(t) with below form: ${{SM}(t)} = {\sum\limits_{i = 1}^{200}\quad \left\lbrack {{{Sa}(i)}{\cos \left\lbrack {2\left( {400 + ɛ} \right)\pi \quad t} \right\rbrack}} \right\rbrack}$

FIG. 4 has following features

1. DATA BUS DS₁˜DS₅ come from DS₁˜DS₅ in FIG. 5 which send Sa(1)˜Sa(200) to data register 11, wherein DS1 sends Sa(1)˜Sa(40), DS2 sends Sa(41)˜Sa(80) . . . DS5 sends Sa(161)˜Sa(200), RS1 is the timing control terminal for data.

2. 08 is circuit in FIG. 3, 09 is synchronous signal generator and sends synchronous signal when RESET signal is over, 012 is operational amplifier, 024 is feedback resistor of 012, 025-1 and 025-2 are input resistors with same resistance, 042-1 and 042-2 are electronic switch, 042-1 is off and 042-2 is on when R2 is HIGH, 071 is inverter.

3. 10 is a timing control circuit which begin to function when RS is excited and generate timing as shown in FIG. 12.

4. Therefore, output S₀ sends synchronous signal within [T₀, T₁′] and mixed transformed signal SM(t) within [T₁′, T₁]

FIG. 5 has following features

1. The box 14 enclosed by dashed line has 5 A/D converters 13-1˜13-5 to convert the analog signals from D₀˜D₄ to digital signals, wherein CL is CLOCK control for sampling.

2. The box 16 enclosed by dashed line has 5 memory means 15-1˜15-5 to store the digital data from A/D converters 13-1˜13-5, wherein AD₁˜AD₅ are address bus, R and W are read and write control.

3. From the control of W end, the digital data from ND converters 13-1˜13-5 are stored in 5 memory means 15-1˜15-5, from the control of R end, the stored digital data are read and output from DS₁˜DS₅

FIG. 6 is the whole hardware of party A, wherein 12 is circuit in FIG. 4, 17 is circuit in FIG. 5. Moreover, 18 is a well-know timing circuit and the description is omitted.

4. The hardware of party B

FIGS. 7-10 is block diagram of party B. FIG. 7 is a figure of a differential circuit comprising four differential means 20-1, 20-2, 20-3 and 20-4, and the description is omitted for they are well known art.

FIGS. 8 and 9 have following features

1. 22-i(i=1,2 . . . 5) in FIG. 8 is circuit in FIG. 9

2. 220 in FIG. 9 is a circuit for solving linear equation set and has parametric memory for storing reverse-transform parameter R(u,v) (u,v=1,2 . . . 200), CE is a timing control end.

3. 221 in FIG. 9 is memory for storing the result of 220, wherein Asi(i=1,2 . . . 5) are address bus, DRi(i=1,2 . . . 5) are data bus and R and W are read and write control ends.

4. In FIG. 8, 23-1˜23-5 are D/A converters, EN is chip enable, R, W, CK are the same as R, W, CK in FIG. 9, data bus DS1˜DS5 are DS1˜DS5 in FIG. 9

FIG. 10 is the whole hardware of party A and has below features.

1. 21 is the differential circuit in FIG. 7, 17 is that shown in FIG. 5, 21 execute first, second, third, fourth order differential operation on SM(t) to get SM′(T), SM″(T), SM′″(T), SM⁽⁴⁾ (T), and send those signal with SM(t) to D₀˜D₄ in 17, those signals are digitized by 5 A/D converters in 17 and stored in memory 15-1˜15-5 in 17.

2. 24 is same as that shown in FIG. 8, the terminals around the dashed box are the same as those in FIG. 8.

3. 25 is a timing control circuit, which initial 21 to execute first, second, third, fourth order differential operation on Si and store those signals with Si into 17, then 5 A/D converters 13-1˜13-5 in 17 digitize those signal and store the result in 15-1˜15-5, the data in 15-1˜15-5 are fetched to 220 in 22-i (i=1,2 . . . 5) for solving linear equation set, the solution are stored in 221, the data in 221 are sent to 23-1˜23-5 to convert into analog signal S₁(5)-S₅(t), thus reverse transforming the data.

4. Circuit 25 is well known and the description thereof is omitted for clarity.

Although the present invention has been described with reference to the preferred embodiment thereof, it will be understood that the invention is not limited to the details thereof. Various substitutions and modifications have suggested in the foregoing description, and other will occur to those of ordinary skill in the art. Therefore, all such substitutions and modifications are intended to be embraced within the scope of the invention as defined in the appended claims. 

I claim:
 1. A method for mixing a plurality of signals, comprising the steps of: (a) using a plurality of data bus for receiving a plurality of analog signals within a time period, each signal being continuous and being able to be mathematically represented by an equation of S_(i)(t) within the time period [T₀, T₁], wherein m is integer, i=1,2, . . . , m, t is time variable, T₀, T₁ εR, tε[T₀, T₁]; (b) using a timing control circuit to sample the signals S_(i)(t) within the time period [T₀, T₁] and obtain n samples for each signal, said samples being mathematically represented by S_(i)(t_(j)), wherein n is integer, t_(j)ε[T₀, T₁], j=1, 2, . . . n; (c) using a generating circuit to generate a predetermined time dependent function group which is a linear independent set and can be mathematically represented by _(i)a_(j)(t), wherein i=1,2 . . . m, j=1,2 . . . n; (d) using a multiplying circuit to multiply each sample S_(i)(t_(j)) with a corresponding time dependent function _(i)a_(j)(t) and generating a transformed signal which can be mathematically represented as ${{S_{i}^{0}(t)} = {\sum\limits_{j = 1}^{n}\quad \left\lbrack {}_{i}{{a_{j}(t)}{S_{i}\left( t_{j} \right)}} \right\rbrack}};$

(e) using an adding circuit to sum up all transformed signals S_(i) ⁰(t) to form a mixed transformed signal which be mathematically represented as SM(t), wherein ${{SM}(t)} = {\sum\limits_{i = 1}^{m}\quad {\left\lbrack {S_{i}^{0}(t)} \right\rbrack.}}$


2. The method as in claim 1, wherein the time dependent function group _(i)a_(j)(t) (i=1 . . . m, j=1,2 . . . n) are such selected that every function of _(i)a_(j)(t) is linear independent for tε[T₀, T₁].
 3. The method as in claim 1, wherein the time dependent function group is mathematically represented as _(k)a_(l)(t) (k=1,2 . . . m, l=1,2 . . . n) within the time period [T₀, T₁] and is mathematically determined by the following functions: selecting a set of m×n functions G₁(t), G₂(t) . . . G_(m×n) (t) which are linearly independent within the time period [T₀, T₁]; letting h(r, s) = ∫_(T₀)^(T₁)G_(r)(x)G_(s)(x)  x;  rs = 1, 2  …  m × n; A₀ = 1; ${A_{v} = {\begin{matrix} {h\left( {1,1} \right)} & {h\left( {1,2} \right)} & {h\left( {1,3} \right)} & \ldots & {h\left( {1,v} \right)} \\ {h\left( {2,1} \right)} & {h\left( {2,2} \right)} & {h\left( {2,3} \right)} & \ldots & {h\left( {2,v} \right)} \\ {h\left( {3,1} \right)} & {h\left( {3,2} \right)} & {h\left( {3,3} \right)} & \ldots & {h\left( {3,v} \right)} \\ \ldots & \ldots & \ldots & \ldots & \ldots \\ {h\left( {v,1} \right)} & {h\left( {v,2} \right)} & {h\left( {v,3} \right)} & \ldots & {h\left( {v,v} \right)} \end{matrix}}};\quad {v = {1.2\quad \ldots \quad m \times n}};$

then establishing the function ${A_{v} = {\begin{matrix} {h\left( {1,1} \right)} & {h\left( {1,2} \right)} & {h\left( {1,3} \right)} & \ldots & {h\left( {1,u} \right)} \\ {h\left( {2,1} \right)} & {h\left( {2,2} \right)} & {h\left( {2,3} \right)} & \ldots & {h\left( {2,u} \right)} \\ \ldots & \ldots & \ldots & \ldots & \ldots \\ {h\left( {{u - 1},1} \right)} & {h\left( {{u - 1},2} \right)} & {h\left( {{u - 1},3} \right)} & \ldots & {h\left( {{u - 1},u} \right)} \\ {G_{1}(t)} & {G_{2}(t)} & {G_{3}(t)} & \ldots & \left. {G_{u}(t)} \right) \end{matrix}}};\quad {u = {1.2\quad \ldots \quad m \times n}};$

then the function ${{{Q_{u}(t)} = {\frac{1}{\sqrt{A_{u - 1}A_{u}}}{P_{u}(t)}}};\quad {u = 1}},{{2\quad \ldots \quad m \times n};\quad \text{and then letting}}$

_(i)a_(j)(t)=Q_((i−1)n+j)(t) (i=1,2 . . . m, l=1,2 . . . n).
 4. The method as in claim 3, wherein _(k)a_(l)(t) (k=1,2 . . . m, l=1,2 . . . n) are orthonormal within the time period [T₀, T₁]).
 5. The method as in claim 1, further comprising a step for solving m×n S_(i)(t_(j)) (i=1,2 . . . m, j=1,2 . . . n), said step taking m×n samples to establish a m×n linear equation set with unknowns S₁(t₁), S₁(t₂), S₁(t₃). . . S₁(t_(n)), S₂(t₁), S₂(t₂) . . . S_(m)(t₁), S_(m)(t₂), . . . S_(m)(t_(n)) and using a hardware to solve this linear equation set with linear algebraic method to get S_(i)(t_(j)) (i=1, . . . m, j=1,2 . . . n).
 6. The method as in claim 1, further comprising a step for solving m×n S_(i)(t_(j)) (i=1,2 . . . m, j=1,2 . . . n) said step establishing m differential equations for SM(t) with respect to t and with each term having different order including zero, then taking n samples to m differential equations within tε[T₀, T₁], and establishing a m×n linear equation set with unknowns S₁(t₁), S₁(t₂), S₁(t₃). . . S₁(t_(n)), S₂(t₁), S₂(t₂) . . . S_(m)(t₁), S_(m)(t₂), . . . S_(m)(t_(n)) and solving this linear equation set with linear algebraic method to get S_(i)(t_(j)) (i=1, . . . m, j=1,2 . . . n).
 7. The method as in claim 1, further comprising a step for solving m×n S_(i)(t_(j)) (i=1,2 . . . m, j=1,2 . . . n), said step performing m integration operation to the transformed signal from timed=0 to time=t, and with each term having different order including zero, then taking n samples to m integral equations within tε[T₀, T₁], and establishing a m×n linear equation set with unknowns S₁(t₁), S₁(t₂), S₁(t₃). . . S₁(t_(n)), S₂(t₁), S₂(t₂) . . . S_(m)(t₁), S_(m)(t₂), . . . S_(m)(t_(n)) and solving this linear equation set with linear algebraic method to get S_(i)(t_(j)) (i=1, . . . m, j=1,2 . . . n).
 8. The method as in claim 1, further comprising a step for solving m×n S_(i)(t_(j)) (i=1,2 . . . m, j=1,2 . . . n), said step establishing r differential equations for SM(t) (r<m) with respect to t and with each term having different order including-zero, then performing m−r integration operation to SM(t) from time=0 to time=t, and with each term having different order including zero, taking n samples to r differential equations and m−r integral equation within tε[T₀, T₁], and establishing a m×n linear equation set with unknowns S₁(t₁), S₁(t₂), S₁(t₃). . . S₁(t_(n)), S₂(t₁), S₂(t₂) . . . S_(m)(t₁), S_(m)(t₂), . . . S_(m)(t_(n)) and solving this linear equation set with linear algebraic method to get S_(i)(t_(j)) (i=1, . . . m, j=1,2 . . . n).
 9. The method as in claim 1, further comprising a step for solving m×n S_(i)(t_(j)) (i=1,2 . . . m, j=1,2 . . . n), said step establishing m difference equations for SM(t) with respect to t and with each term having different order including zero, then taking n samples to m difference equations within tε[T₀, T₁], and establishing a m×n linear equation set with unknowns S₁(t₁), S₁(t₂), S₁(t₃). . . S₁(t_(n)), S₂(t₁), S₂(t₂) . . . S_(m)(t₁), S_(m)(t₂), . . . S_(m)(t_(n)) and solving this linear equation set with linear algebraic method to get S_(i)(t_(j)) (i=1, . . . m, j=1,2 . . . n).
 10. The method as in claim 1, further comprising a step for solving m×n S_(i)(t_(j)) (i=1,2 . . . m, j=1,2 . . . n), said step performing m summation operation to SM(t) from time=0 to time=t, and with each term having different order including zero, then taking n samples to m summation equations within tε[T₀, T₁], and establishing a m×n linear equation set with unknowns S₁(t₂), S₁(t₃). . . S₁(t_(n)), S₂(t₁), S₂(t₂) . . . S_(m)(t₁), S_(m)(t₂), . . . S_(m)(t_(n)) and solving this linear equation set with linear algebraic method to get S_(i)(t_(j)) (i=1, . . . m, j=1,2 . . . n).
 11. The method as in claim 1, further comprising a step for solving m×n S_(i)(t_(j)) (i=1,2 . . . m, j=1,2 . . . n), said step establishing r difference equations for SM(t) (r<m) with respect to t and with each term having different order including zero, then perform m−r summation operation to SM(t) from time=0 to time=t, and with each term having different order including zero, taking n samples to r difference equations and m−r summation equation within tε[T₀, T₁], and establishing a m×n linear equation set with unknowns S₁(t₁), S₁(t₂), S₁(t₃) . . . S₁(t_(n)), S₂(t₁), S₂(t₂) . . . S_(m)(t₁), S_(m)(t₂), . . . S_(m)(t_(n)) and solving this linear equation set with linear algebraic method to get S_(i)(t_(j)) (i=1, . . . m, j=1,2 . . . n).
 12. The method as in claim 1, further comprising a step for solving m×n S_(i)(t_(j)) (i=1,2 . . . m, j=1,2 . . . n), said step establishing r1 differential equations for SM(t) (r1=0 or <=m) with respect to t and with each term having different order including zero, establishing r2 difference equations for SM(t) (r2=0 or <=m) with respect to t and with each term having different order including zero, then performing r3 integration operation to SM(t) (r3=0 or <=m) from time=0 to time=t, and with each term having different order including zero, then performing r4 summation operation to SM(t) (r4=0 or <=m) from time=0 to time=t, and with each term having different order including zero, wherein r1+r2+r3+r4=m, then taking n samples to r1 differential equations, r2 difference equations, r3 integral equation and r4 summation equations within tε[T₀, T₁]: and establishing a m×n linear equation set with unknowns S₁(t₂), S₁(t₃) . . . S₁(t_(n)), S₂(t₁), S₂(t₂) . . . S_(m)(t₁), S_(m)(t₂), . . . S_(m)(t_(n)) and solving this linear equation set with linear algebraic method to get S_(i)(t_(j)) (i=1, . . . m, j=1,2 . . . n).
 13. The method as in claim 1, wherein the predetermined time dependent function group _(i)a_(j)(t) (i=1, . . . m, j=1,2 . . . n) for SM(t) are linear independent such that the S_(i)(t) within the time period [T₀, T₁] can be solved by linear algebra technique.
 14. The method as in claim 4, further comprising a step for restoring m×n S_(i)(t_(j)) (i=1,2 . . . m, j=1,2 . . . n), from SM(t), wherein {_(i)a_(j)(t) (i=1,2 . . . m, j=1,2 . . . n)} are orthonormal within the time period [T₀, T₁], said step comprising: multiplying _(i)a_(j)(t) to SM(t) and integrating the result within time period [T₀, T₁] to get S_(i)(t_(j)) (i=1,2 . . . m, j=1,2 . . . n).
 15. The method as in claim 4, further comprising a step for restoring m×n S_(k)(t_(l)) (k=1,2 . . . m, l=1,2 . . . n) from SM(t), wherein {_(i)a_(j)(t) (i=1, 2 . . . m, j=1,2 . . . n)} are orthonormal within the time period [T₀, T₁], said step comprising: preparing m×n×M restoring parameters ${\frac{1}{q!}{{{}_{}^{}{}_{}^{(q)}}(b)}\quad \left( {{k = 1},{2\quad \ldots \quad m},{l = 1},{2\quad \ldots \quad n},{q = 0},{{1\quad \ldots \quad M};{b \in R}}} \right)},$

 calculating M data, ∫_(T₀)^(T₁)SM(x)(x − b)^(q)  x;

q=0, 1, 2 . . . M−1; bεR calculating S_(k)(t_(l)) using following equation ${S_{k}\left( t_{l} \right)} = {\sum\limits_{q = 0}^{M - 1}\quad {\left\lbrack {\frac{1}{q!}{{{}_{}^{}{}_{}^{(q)}}(b)}{\int_{T_{0}}^{T_{1}}{{{SM}(x)}{\left( {x - b} \right)\quad}^{q}{x}}}} \right\rbrack.}}$


16. The method as in claim 4, wherein after obtaining SM(t) by using functions ${S_{i}^{0}(t)} = {\sum\limits_{j = 1}^{n}\quad \left\lbrack {}_{i}{{a_{j}(t)}{S_{i}\left( t_{j} \right)}} \right\rbrack}$

and ${{{SM}(t)} = {\sum\limits_{i = 1}^{m}\quad \left\lbrack {S_{i}^{0}(t)} \right\rbrack}},$

further comprising the following step: choose {_(i)a_(j)(t) (i=1,2 . . . m, j=1,2 . . . n)} by method in claim 3; calculate SM(t) using ${S_{i}^{0}(t)} = {\sum\limits_{j = 1}^{n}\quad \left\lbrack {}_{i}{{a_{j}(t)}{S_{i}\left( t_{j} \right)}} \right\rbrack}$

and ${{SM}(t)} = {\sum\limits_{i = 1}^{m}\quad \left\lbrack {S_{i}^{0}(t)} \right\rbrack}$

 calculating M compression data by using the function of ∫_(T₀)^(T₁)SM(x)(x − b)^(q)  x;

q=0, 1 ,2 . . . M−1; bεR using SM(t), wherein t within period [T₀, T₁].
 17. The method according to claim 1, further comprising the following steps after step (d): using the timing control circuit to divid the time period [T₀, T₁] into a synchronous time period and an information time period; sending a synchronous signal in the synchronous period; sending mixed transformed signal SM(t) in the information period.
 18. A hardware device comprising: m A/D converters for sampling S_(i)(t) and digitizing the samples; m×n signal generators for generating _(i)a_(j)(t) signals; m×n multipliers for calculating _(i)a_(j)(t) and S_(i)(t), wherein S_(i)(t_(j)) is the j-th sampling of S_(i)(t); an adder for calculating $\sum\limits_{j = 1}^{n}\quad \left\lbrack {}_{i}{{a_{j}(t)}{S_{i}\left( t_{j} \right)}} \right\rbrack$

a synchronous signal generator for generating synchronous signal within the time period [T₀, T₁]; and a timing controller for regulating the timing control of above components.
 19. A hardware device for separating a mixed transformed signal SM(t), comprising: a first circuit for detecting a synchronous signal; (m×n)² memory device for use in solving linear algebra equations; at least one logic circuit for pre-handling the mixed transformed signal SM(t) to obtain a output result; a plurality of A/D converters for sampling said output result to obtain a plurality of sampling results and digitizing the sampling results; a plurality of adders and multipliers; a calculating means for calculating original samples S_(i)(t_(j)) of the S_(i)(t) according to the data stored in original samples S_(i)(t_(j)) of the S_(i)(t) and then outputting from the A/D converters; and a timing controller for regulating the timing control of above components.
 20. The device as in claim 19, further comprising m D/A converters for transforming the original samples S_(i)(t_(j)) (i=1,2 . . . m, j=1,2 . . . n) to analog signals.
 21. The device as in claim 19, wherein said logic circuit comprises a plurality of differential circuits for taking differential to SM(t).
 22. The device as in claim 19, wherein said logic circuit comprises a plurality of difference circuits for taking difference to SM(t).
 23. The device as in claim 19, wherein said logic circuit comprises a plurality of integration circuits for taking integration to SM(t) from 0 to t.
 24. The device as in claim 19, wherein said logic circuit comprises a plurality of summation circuits for taking summation to SM(t) from 0 to t. 